Rewrite

Rewrite, Rewrite, Rewrite

We study properties of rewrite systems that are not necessarily terminating, but allow instead for trans nite derivations that have a limit. In particular, we give conditions for the existence of a limit and for its uniqueness and relate the operational and algebraic semantics of in nitary theories. We also consider su cient completeness of hierarchical systems. Is there no limit? |Job 16:3

Rewrite Systems

On Rewrite Constraints

Process Rewrite Systems

Many formal models for in nite-state concurrent systems are equivalent to special classes of rewrite systems. We classify these models by their expressiveness and de ne a hierarchy of classes of rewrite systems. We show that this hierarchy is strict with respect to bisimulation equivalence. The most general and most expressive class of systems in this hierarchy is called Process Rewrite Systems...

Normalization via Rewrite Closures